منابع مشابه
Bounding prime models
A set X is prime bounding if for every complete atomic decidable (CAD) theory T there is a prime model A of T decidable in X. It is easy to see that X = 0′ is prime bounding. Denisov claimed that every X <T 0′ is not prime bounding, but we discovered this to be incorrect. Here we give the correct characterization that the prime bounding sets X ≤T 0′ are exactly the sets which are not low2. Reca...
متن کاملDegree spectra of prime models
We consider the Turing degrees of prime models of complete decidable theories. In particular we show that every complete decidable atomic theory has a prime model whose elementary diagram is low. We combine the construction used in the proof with other constructions to show that complete decidable atomic theories have low prime models with added properties. If we have a complete decidable atomi...
متن کاملAlgebraically Periodic Translation Surfaces
Translation surfaces arise in complex analysis, the classification of surface diffeomorphisms and the study of polygonal billiards. In recent years there have been some notable advances in understanding their properties. In particular Calta and McMullen have made significant advances in understanding translation structures in genus 2. This paper is motivated by our desire to reformulate and ext...
متن کاملAlgebraically Coherent Categories
We call a nitely complete category algebraically coherent if the change-ofbase functors of its bration of points are coherent, which means that they preserve nite limits and jointly strongly epimorphic pairs of arrows. We give examples of categories satisfying this condition; for instance, coherent categories, categories of interest in the sense of Orzech, and (compact) Hausdor algebras over a ...
متن کاملExtended Conscriptions Algebraically
Conscriptions are a model of sequential computations with assumption/commitment specifications in which assumptions can refer to final states, not just to initial states. We show that they instantiate existing algebras for iteration and infinite computations. We use these algebras to derive an approximation order for conscriptions and one for extended conscriptions, which additionally represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Mathematical Logic
سال: 1981
ISSN: 0003-4843
DOI: 10.1016/0003-4843(81)90007-3